TWO-DIMENSIONAL DIGITIZED PICTURE ARRAYS AND PARIKH MATRICES
نویسندگان
چکیده
منابع مشابه
Parikh Matrices and Parikh Rewriting Systems
Since the introduction of the Parikh matrix mapping, its injectivity problem is on top of the list of open problems in this topic. In 2010 Salomaa provided a solution for the ternary alphabet in terms of a Thue system with an additional feature called counter. This paper proposes the notion of a Parikh rewriting system as a generalization and systematization of Salomaa’s result. It will be show...
متن کاملExtending Parikh matrices
We introduce the notion of Parikh matrix induced by a word, a natural extension to the notion of Parikh matrix and prove a set of properties for this kind of matrices. We also study the relation between these two notions. We show that combining properties from both we obtain a more powerful tool for proving algebraic properties of words.
متن کاملOn Parikh Matrices
Mateescu et al (2000) introduced an interesting new tool, called Parikh matrix, to study in terms of subwords, the numerical properties of words over an alphabet. The Parikh matrix gives more information than the well-known Parikh vector of a word which counts only occurrences of symbols in a word. In this note a property of two words u, v, called “ratio property”, is introduced. This property ...
متن کاملExtending Parikh q-matrices
1. A. Atanasiu. Binary amiable words. International Journal of Foundations of Computer Science, 18(2):387–400, 2007. 2. A. Atanasiu, R. Atanasiu, and I. Petre. Parikh matrices and amiable words. Theoretical Computer Science, 390:102–109, 2008. 3. A. Atanasiu, C. Martin-Vide, and A. Mateescu. On the injectivity of the parikh matrix mapping. Fundamenta Informatica, 46:1–11, 2001. 4. S. Bera and K...
متن کاملParikh matrices and amiable words
Using the fact that the Parikh matrix mapping is not an injective mapping, the paper investigates some properties of the set of words with the same Parikh matrix; these words are called “amiable”. The presented results extend the results obtained in [1] for the binary case. In particular it is shown that all the words having the same Parikh matrix can be obtained one from another by applying on...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Foundations of Computer Science
سال: 2013
ISSN: 0129-0541,1793-6373
DOI: 10.1142/s012905411350010x